Off the grid tensor completion for seismic data interpolation
نویسندگان
چکیده
منابع مشابه
Evaluation of a New 5D Seismic Volume Reconstruction Method: Tensor Completion versus Fourier Reconstruction
Multi-dimensional Fourier interpolators have become the industry standard for 5D seismic volume reconstruction. However, room for improvement exists and a few key aspects of seismic data reconstruction do require additional study. The latter includes stability in the presence of coherent noise and statics, recovery conditions for extremely sparse data sets and computational efficiency. This pre...
متن کامل3d Interpolation Using Hankel Tensor Completion by Orthogonal Matching Pursuit
Introduction. Seismic data are often sparsely or irregularly sampled along one or more spatial axes. Irregular sampling can produce artifacts in seismic imaging results, thus multidimensional interpolation of seismic data is often a key processing step in exploration seismology. Many solution methods have appeared in the literature: for instance in Spitz (1991), Sacchi (2000) it was proposed to...
متن کاملTensor completion based on nuclear norm minimization for 5D seismic data reconstruction
Prestack seismic data are multidimensional signals that can be described as a low-rank fourth-order tensor in the frequency − space domain. Tensor completion strategies can be used to recover unrecorded observations and to improve the signal-to-noise ratio of prestack volumes. Additionally, tensor completion can be posed as an inverse problem and solved using convex optimization algorithms. The...
متن کاملInterpolation using Hankel tensor completion
We present a novel multidimensional seismic trace interpolator that works on constant-frequency slices. It performs completion on Hankel tensors whose order is twice the number of spatial dimensions. Completion is done by fitting a PARAFAC model using an Alternating Least Squares algorithm. The new interpolator runs quickly and can better handle large gaps and high sparsity than existing comple...
متن کاملHierarchical Tucker Tensor Optimization - Applications to Tensor Completion
Abstract—In this work, we develop an optimization framework for problems whose solutions are well-approximated by Hierarchical Tucker (HT) tensors, an efficient structured tensor format based on recursive subspace factorizations. Using the differential geometric tools presented here, we construct standard optimization algorithms such as Steepest Descent and Conjugate Gradient for interpolating ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015